A Modular Parser for French
نویسنده
چکیده
I n t h i s p a p e r , w e d e s c r i b e a n e f f i c i e n t p a r s e r f o r F r e n c h based o n a n a d a p t a t i o n o f Chomsky 's G o v e r n m e n t B i n d i n g (GB) t h e o r y . R e f l e c t i n g t h e modu la r c o n c e p t i o n o f a GB grammar, t h e p a r s e r c o n s i s t s o f s e v e r a l d i s t i n c t p r o c e d u r e s c o r r e s p o n d i n g t o t h e subsys tems o f t h e grammar ( e . g . p h r a s e s t r u c t u r e r u l e s , b i n d i n g , c o n t r o l , ' t h e t a ' t h e o r y , e t c . ) . The i n t e r a c t i o n o f t h e s e f a i r l y s i m p l e modu les p r o d u c e s t h e k i n d o f c o m p l e x i t y r e q u i r e d i n o r d e r t o b u i l d a l l t h e l i n g u i s t i c a l l y m o t i v a t e d s t r u c t u r e s f o r a g i v e n s e n t e n c e .
منابع مشابه
Feature Engineering in Persian Dependency Parser
Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...
متن کاملModular and Extensible Parser Implementation using Mixins (DRAFT)
This paper describes a method to construct highly modular and extensible recursive descent parser. This parser is used in an extensible Java preprocessor, EPP. EPP can be extended by adding plug-ins which extend Java syntax and add new language features. The EPP's parser consists of small mixins. A recursive descent parser class is constructed by composing these mixins. The syntax accepted by t...
متن کاملXLFG-an LFG parsing scheme for French
We present XLFG, a new parser for LFG developed by Lionel Clément (Clément 2000), (Clément 2001b). This parser is freely available for pedagogical as well as for research purpose. In this paper, we explain how the tool has been used to develop and evaluate a medium-size LFG for French. We also show how we have exploited the similarities between the LFG and the Tree Adjoining Grammar Frameworks ...
متن کاملModularity, Parallelism, And Licensing In A Principle-Based Parser For German
This paper presents a direct implementation of Government-Binding theory in a parser for German, which faithfully models the modular structure of the theory. The modular design yields a flexible environment, in which it is possible to define and test various versions of principles and parameters. The several modules of linguistic theory and the parser proper are interleaved in parallel fashion ...
متن کاملSyntax-based speech recognition: how a syntactic parser can help a recognition system
This contribution is a report on an on-going research aiming at the development of a speech recognition system for French, combining a standard HMM recognition tool with a syntactic parser. Because of the very high number of homophones in French and because several agreement rules spread over an unbounded number of words, we designed our GB-based morphological and syntactic parser to output a c...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کامل